Adaptive replacement policy for hybrid cache architecture
نویسندگان
چکیده
منابع مشابه
Cache Replacement Policy Using Map-based Adaptive Insertion
In this paper, we propose a map-based adaptive insertion policy (MAIP) for a novel cache replacement. The MAIP estimates the data reuse possibility on the basis of data reuse history. To track data reuse history, the MAIP employs a bitmap data structure, which we call memory access map. The memory access map holds all memory accessed locations in a fixed sized memory area to detect the data reu...
متن کاملCooperative Cache Replacement Policy for MANETs
Mobile Adhoc Networks (MANETs) are autonomously structured multi-hop wireless links in peer to peer fashion without aid of any infrastructure network. In MANETs network topology is dynamic, as nodes are mobile. Due to this dynamic topology and multi-hop environment data availability in MANETs is low. Caching of frequently accessed data in ad hoc networks is a potential technique that can improv...
متن کاملAnalyzing Adaptive Cache Replacement Strategies
Adaptive Replacement Cache (Arc) and CLOCK with Adaptive Replacement (Car) are state-of-theart “adaptive” cache replacement algorithms invented to improve on the shortcomings of classical cache replacement policies such as Lru, Lfu and Clock. By separating out items that have been accessed only once and items that have been accessed more frequently, both Arc and Car are able to control the harm...
متن کاملSecure Hierarchy-Aware Cache Replacement Policy (SHARP)
In cache-based side channel attacks, a spy that shares a cache with a victim probes cache locations to extract information on the victim’s access patterns. For example, in evict+reload, the spy repeatedly evicts and then reloads a probe address, checking if the victim has accessed the address in between the two operations. While there are many proposals to combat these cache attacks, they all h...
متن کاملAn Efficient Web Cache Replacement Policy
Several replacement policies for web caches have been proposed and studied extensively in the literature. Different replacement policies perform better in terms of (i) the number of objects found in the cache (cache hit), (ii) the network traffic avoided by fetching the referenced object from the cache, or (iii) the savings in response time. In this paper, we propose a simple and efficient repl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Electronics Express
سال: 2014
ISSN: 1349-2543
DOI: 10.1587/elex.11.20140946